Graph operations

Results: 797



#Item
51The k -in-a-path problem for claw-free graphs ´ + , Bernard Lidický∗ , Jiˇrí Fiala∗ , Marcin Kaminski Daniël Paulusma∗∗ Charles University∗ Université Libre de Bruxelles+

The k -in-a-path problem for claw-free graphs ´ + , Bernard Lidický∗ , Jiˇrí Fiala∗ , Marcin Kaminski Daniël Paulusma∗∗ Charles University∗ Université Libre de Bruxelles+

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:45:35
52Finding Textures in Sketches using Planar Ising Models Matthew D. McLure, Subu Kandaswamy, and Kenneth D. Forbus Northwestern University Abstract Creating software that can understand the range of sketches

Finding Textures in Sketches using Planar Ising Models Matthew D. McLure, Subu Kandaswamy, and Kenneth D. Forbus Northwestern University Abstract Creating software that can understand the range of sketches

Add to Reading List

Source URL: qr15.sift.net

Language: English - Date: 2015-08-11 09:14:44
53Geoinformatica DOIs10707Task selection in spatial crowdsourcing from worker’s perspective Dingxiong Deng1 · Cyrus Shahabi1 ·

Geoinformatica DOIs10707Task selection in spatial crowdsourcing from worker’s perspective Dingxiong Deng1 · Cyrus Shahabi1 ·

Add to Reading List

Source URL: infolab.usc.edu

Language: English - Date: 2016-05-21 03:16:43
54Minimal Disconnected Cuts in Planar Graphs  ? Marcin Kami´ nski1 , Dani¨el Paulusma2 ,

Minimal Disconnected Cuts in Planar Graphs ? Marcin Kami´ nski1 , Dani¨el Paulusma2 ,

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2016-07-28 03:13:11
55SIAM J. COMPUT. Vol. 40, No. 5, pp. 1234–1257 c 2011 Society for Industrial and Applied Mathematics 

SIAM J. COMPUT. Vol. 40, No. 5, pp. 1234–1257 c 2011 Society for Industrial and Applied Mathematics 

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2011-12-14 13:59:20
56Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Department of Computer Science and Engineering Chalmers University of Technology SG¨oteborg, Sweden

Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Department of Computer Science and Engineering Chalmers University of Technology SG¨oteborg, Sweden

Add to Reading List

Source URL: www.cse.chalmers.se

Language: English - Date: 2011-05-18 09:50:44
57CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16,

CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-03-01 15:15:38
58Dynamic Graph Labeling Andreas Kinell Instructors: Regina O’Dell Roger Wattenhofer November 6, 2004

Dynamic Graph Labeling Andreas Kinell Instructors: Regina O’Dell Roger Wattenhofer November 6, 2004

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:37:00
59Spectral Graph Theory  Lecture 9 Tutte’s Theorem Daniel A. Spielman

Spectral Graph Theory Lecture 9 Tutte’s Theorem Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2015-09-30 14:01:49
60Moment methods in energy minimization David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin)  L´aszl´

Moment methods in energy minimization David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) L´aszl´

Add to Reading List

Source URL: www.daviddelaat.nl

Language: English